An Improved Extreme Learning Machine Based on Full Rank Cholesky Factorization
نویسندگان
چکیده
منابع مشابه
Strong Rank Revealing Cholesky Factorization
STRONG RANK REVEALING CHOLESKY FACTORIZATION M. GU AND L. MIRANIAN y Abstract. For any symmetric positive definite n nmatrixAwe introduce a definition of strong rank revealing Cholesky (RRCh) factorization similar to the notion of strong rank revealing QR factorization developed in the joint work of Gu and Eisenstat. There are certain key properties attached to strong RRCh factorization, the im...
متن کاملAn Improved Local Coupled Extreme Learning Machine
Local Coupled Extreme Learning Machine (LCELM) is a recently-proposed variant of ELM, which assigns an address for each hidden-layer node and activates the hidden-layer node when its activated degree is less than a given threshold. In this paper, an improved version of LCELM is proposed by developing a new way to initialize the address for each hidden-layer node and calculating the activated de...
متن کاملAn Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization
Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system Ax = b when A comes from a discretized partial-differential equat...
متن کاملAn Improved Extreme Learning Machine for Classification Problem Based on Affinity Propagation Clustering
Xinjie Wu School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, Jiangsu, 221116, China,[email protected] Abstract Extreme learning machine (ELM) is an efficient algorithm for single-hidden layer feedforward neural networks (SLFNs), which can produce good generalization performance in most cases and learn thousands of times faster than conventional p...
متن کاملMachine Comprehension Based on Learning to Rank
Machine comprehension plays an essential role in NLP and has been widely explored with dataset like MCTest. However, this dataset is too simple and too small for learning true reasoning abilities. (Hermann et al., 2015) therefore release a large scale news article dataset and propose a deep LSTM reader system for machine comprehension. However, the training process is expensive. We therefore tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2018
ISSN: 2261-236X
DOI: 10.1051/matecconf/201824603018